Applying, Improving and Analyzing Some Heuristics for Binary Codes in Combinatorial DNA Design
نویسندگان
چکیده
Combinatorial algorithms have long been used to design error correcting codes with various constraints such as Hamming distance or weight. Such algorithms have been used to design DNA codes, which parallel error correcting codes in many ways. We implemented two algorithms from coding theory and adapted them for DNA. We tried several improvements and combinations and we will discuss the empirical analysis and the strengths and weaknesses of each variant.
منابع مشابه
Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملDNA Code Word Design
The design of codes that satisfy combinatorial constraints is motivated by the problem of sending information reliably over a noisy channel and has been studied for a long time. There are lots of studies on binary code design where the alphabet consists of 2 letters {0, 1}. Recently, designing codes over 4 letters alphabet, which is motivated by the task of storing and retrieving information in...
متن کاملEquireplicate Balanced Binary Codes for Oligo Arrays
In the manufacture of oligo arrays for DNA hybridization experiments, manufacturing defects must be detected and their position determined. The design of manufacturing protocols for such oligo arrays leads to a combinatorial problem, requiring certain binary codes which have an additional balance property. Constructions using block designs and packings for these codes, within a range of interes...
متن کاملOn combinatorial DNA word design
We consider the problem of designing DNA codes, namely sets of equi-length words over the alphabet [A, C, G, T] that satisfy certain combinatorial constraints. This problem is motivated by the task of reliably storing and retrieving information in synthetic DNA strands for use in DNA computing or as molecular bar codes in chemical libraries. The primary constraints that we consider, defined wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005